Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
نویسندگان
چکیده
A company frequently decides on location and design for new facilities in a sequential way. However, for a fixed number of new facilities (in this study we restrict ourselves to the case of two new facilities), the company might improve its profit by taking its decisions for all the facilities simultaneously. In this paper a profit maximization problem is considered, where the market share captured by each facility depends on both the distance to the customers (location) and its quality (design), and it is determined by a Huff-like model. Recent research on this type of models was aimed at finding global optima for a single new facility, holding quality fixed or variable, but no exact algorithm has been proposed to find optimal solutions for more than one facility. The existing algorithms coping with the simultaneous problem do a cycle search in which only one location is optimized independently, holding all other locations fixed; therefore it cannot guarantee that an optimal solution has been found. In this paper we propose an exact interval branch-and-bound algorithm to solve the simultaneous location and design 2-facilities problem. We present some computational results to compare the locations and qualities of the optimal solutions obtained by a sequential and two simultaneous approaches.
منابع مشابه
Sequential Competitive Facility Location Problem in a Discrete Planar Space
In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...
متن کاملSequential Competitive Facility Location Problem in a Discrete Planar Space
In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens p new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candidate...
متن کاملOptimal Capacities in Discrete Facility Location Design Problem
Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...
متن کاملNew spatial clustering-based models for optimal urban facility location considering geographical obstacles
The problems of facility location and the allocation of demand points to facilities are crucial research issues in spatial data analysis and urban planning. It is very important for an organization or governments to best locate its resources and facilities and efficiently manage resources to ensure that all demand points are covered and all the needs are met. Most of the recent studies, which f...
متن کاملMultimodal Transportation p-hub Location Routing Problem with Simultaneous Pick-ups and Deliveries
Centralizing and using proper transportation facilities cut down costs and traffic. Hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. A distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 36 شماره
صفحات -
تاریخ انتشار 2009